Discrete linear canonical transform on graphs

With the wide application of spectral and algebraic theory in discrete signal processing techniques field graph processing, an increasing number methods have been proposed, such as Fourier transform, wavelet transform windowed transform. In this paper, we propose design definition linear canonical on graphs (GLCT), which is extension (DLCT), just (GFT) (DFT). First, based centrality scalability DLCT eigendecomposition approach, GLCT proposed by combining chirp-Fourier scale fractional Second, derive discuss properties special cases GLCT. Finally, some examples signals comparisons with are given to illustrate improvement transformation.